منابع مشابه
Euclidean Greedy Drawings of Trees
Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each sourcedestination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some distance metric. The existence of Euclidean greedy embeddings in R is known for certain graph classes such as 3-connected planar graphs. We compl...
متن کاملSuccinct Greedy Drawings May Be Unfeasible
A greedy drawing is a straight-line drawing that contains a distance-decreasing path for every pair of nodes. A path (v0, v1, . . . , vm) is distance-decreasing if d(vi, vm) < d(vi−1, vm), for i = 1, . . . ,m. Greedy drawings easily support geographic greedy routing. Hence, a natural and practical problem is the one of constructing greedy drawings in the plane, using few bits for representing v...
متن کاملComplexity of Finding Non-Planar Rectilinear Drawings of Graphs
Monotone Drawings of Graphs p. 13 Upward Geometric Graph Embeddings into Point Sets p. 25 On a Tree and a Path with No Geometric Simultaneous Embedding p. 38 Difference Map Readability for Dynamic Graphs p. 50 Maximizing the Total Resolution of Graphs p. 62 Plane Drawings of Queue and Deque Graphs p. 68 An Experimental Evaluation of Multilevel Layout Methods p. 80 Orthogonal Graph Drawing with ...
متن کاملA Pseudo-Greedy Heuristic for the Rectilinear Steiner Problem
A new heuristic solution procedure for the solution of the rectilinear Steiner problem is proposed. The procedure is based on an innovative neighborhood structure that is explored using a pseudo-greedy approach. The probabilistic rules designed to induce search diversification are based on move attributes derived from the neighborhood structure. A Taguchi design of experiments is used to find t...
متن کاملOn Planar Greedy Drawings of 3-Connected Planar Graphs
A graph drawing is greedy if, for every ordered pair of vertices (x, y), there is a path from x to y such that the Euclidean distance to y decreases monotonically at every vertex of the path. Greedy drawings support a simple geometric routing scheme, in which any node that has to send a packet to a destination “greedily” forwards the packet to any neighbor that is closer to the destination than...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.07.019